Unary operations with long pre-periods

Unary Language Operations and Their Nondeterministic State Complexity

Average State Complexity of Operations on Unary Automata

Deene the complexity of a rational language as the number of states of its minimal automaton. Let A (respectively A 0) be an n-state (resp. n 0-state) deterministic and connected unary automaton. Our main results can be summarized as follows: 1. The probability that A is minimal tends toward 1=2 when n tends toward innnity, 2. The average complexity of L(A) is equivalent to n, 3. The average co...

Spell durations with long unemployment insurance periods

This paper uses data from a natural experiment to investigate the potential incentive effect of a fixed unemployment insurance period. We compare two large groups of Norwegian unemployed persons who registered as unemployed in 1990 and 1991. The last group was affected by a rule change that in practice extended the length of unemployment benefits to more than 3 years. Our data are taken from of...

A Materialized View Approach to Support Aggregation Operations over Long Periods in Sensor Networks

The increasing interest on processing data created by sensor networks has evolved into approaches to implement sensor networks as databases. The aggregation operator, which calculates a value from a large group of data such as computing averages or sums, etc. is an essential function that needs to be provided when implementing such sensor network databases. This work proposes to add the DURING ...

Pre-Finishing Operations

Virtually all products that are finished require some pre-finishing procedure such as cleaning, stripping, or pickling. Without a properly cleaned surface, even the most expensive coating will fail to adhere or protect the workpiece. Depending on the process being performed, the degree of cleanliness will vary. Finishing operations such as phosphating, chromating, or electropolishing do not req...